Optimized Topological Surgery for Unfolding 3D Meshes

نویسندگان

  • Shigeo Takahashi
  • Hsiang-Yun Wu
  • Seow Hui Saw
  • Chun-Cheng Lin
  • Hsu-Chun Yen
چکیده

Constructing a 3D papercraft model from its unfolding has been fun for both children and adults since we can reproduce virtual 3D models in the real world. However, facilitating the papercraft construction process is still a challenging problem, especially when the shape of the input model is complex in the sense that it has large variation in its surface curvature. This paper presents a new heuristic approach to unfolding 3D triangular meshes without any shape distortions, so that we can construct the 3D papercraft models through simple atomic operations for gluing boundary edges around the 2D unfoldings. Our approach is inspired by the concept of topological surgery, where the appearance of boundary edges of the unfolded closed surface can be encoded using a symbolic representation. To fully simplify the papercraft construction process, we developed a genetic-based algorithm for unfolding the 3D mesh into a single connected patch in general, while optimizing the usage of the paper sheet and balance in the shape of that patch. Several examples together with user studies are included to demonstrate that the proposed approach works well for a broad range of 3D triangular meshes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Control of Topological Transitions in Morphing Shapes of 3D Meshes

Existing methods of morphing 3D meshes are often limited to cases in which 3D input meshes to be morphed are topologically equivalent. This paper presents a new method for morphing 3D meshes having different surface topological types. The most significant feature of the method is that it allows explicit control of topological transitions that occur during the morph. Transitions of topological t...

متن کامل

A Topological Framework for Interactive Queries on 3D Models in the Web

Several technologies exist to create 3D content for the web. With X3D, WebGL, and X3DOM, it is possible to visualize and interact with 3D models in a web browser. Frequently, three-dimensional objects are stored using the X3D file format for the web. However, there is no explicit topological information, which makes it difficult to design fast algorithms for applications that require adjacency ...

متن کامل

New Results in Signal Processing and Compression of Polygon Meshes

Polygon meshes, which are used in most graphics applications, require considerable amounts of storage, even when they only approximate precise shapes with limited accuracy. To support internet access to 3D models of complex virtual environments or assemblies for electronic shopping, collaborative CAD, multi-player video games, and scientific visualization, representations of 3D shapes must be c...

متن کامل

On Reconstructing Surfaces with Genus Greater than Zero from Range Images

The algorithm Radial Flow Model can generate a 3D closed triangular mesh which fits an unregistered range image. Though complex meshes may be produced, they are restricted to be homeomorph to spheres. In this communication, we present some ideas that may overcome this constraint. Methods for reconstructing from range images the surface of a three dimensional object have evolved rapidly in recen...

متن کامل

The FEM approach to the 3D electrodiffusion on 'meshes' optimized with the Metropolis algorithm

The presented article contains a 3D mesh generation routine optimized with the Metropolis algorithm. The procedure enables to produce meshes of a prescribed volume V0 of elements. The finite volume meshes are used with the Finite Element approach. The FEM analysis enables to deal with a set of coupled nonlinear differential equations that describes the electrodiffusional problem. Mesh quality a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2011